Coloring Uniform Hypergraphs with Small Edge Degrees
نویسندگان
چکیده
The degree of an edge e in a hypergraph G is the number of other edges of G intersecting e, and the maximum edge degree of G is the maximum over the degrees of its edges. A natural question is: Which bound on the maximum edge degree of an r-uniform hypergraph G provides that G is k-colorable? The classical result in this direction belongs to Erdős and Lovász. In their seminal paper [2] (where the Lovász Local Lemma appeared), they proved the following bound.
منابع مشابه
The 1-2-3-Conjecture for Hypergraphs
A weighting of the edges of a hypergraph is called vertex-coloring if the weighted degrees of the vertices yield a proper coloring of the graph, i.e., every edge contains at least two vertices with different weighted degrees. In this paper we show that such a weighting is possible from the weight set {1, 2, . . . , r + 1} for all linear hypergraphs with maximum edge size r ≥ 4 and not containin...
متن کاملHarmonious and achromatic colorings of fragmentable hypergraphs
A harmonious coloring of a k-uniform hypergraphH is a rainbow vertex coloring such that each k-set of colors appears on at most one edge. A rainbow coloring of H is achromatic if each k-set of colors appears on at least one edge. The harmonious (resp. achromatic) number of H , denoted by h(H) (resp. ψ(H)) is the minimum (resp. maximum) possible number of colors in a harmonious (resp. achromatic...
متن کاملCovering complete partite hypergraphs by monochromatic components
A well-known special case of a conjecture attributed to Ryser (actually appeared in the thesis of Henderson [7]) states that k-partite intersecting hypergraphs have transversals of at most k−1 vertices. An equivalent form of the conjecture in terms of coloring of complete graphs is formulated in [1]: if the edges of a complete graph K are colored with k colors then the vertex set of K can be co...
متن کاملColor-bounded hypergraphs, V: host graphs and subdivisions
A color-bounded hypergraph is a hypergraph (set system) with vertex set X and edge set E = {E1, . . . , Em}, together with integers si and ti satisfying 1 ≤ si ≤ ti ≤ |Ei| for each i = 1, . . . ,m. A vertex coloring φ is proper if for every i, the number of colors occurring in edge Ei satisfies si ≤ |φ(Ei)| ≤ ti. The hypergraph H is colorable if it admits at least one proper coloring. We consid...
متن کاملMonochromatic Path and Cycle Partitions in Hypergraphs
Here we address the problem to partition edge colored hypergraphs by monochromatic paths and cycles generalizing a well-known similar problem for graphs. We show that r-colored r-uniform complete hypergraphs can be partitioned into monochromatic Berge-paths of distinct colors. Also, apart from 2k − 5 vertices, 2-colored k-uniform hypergraphs can be partitioned into two monochromatic loose paths...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010